Multidimensional Static Block Data Decomposition for Heterogeneous Clusters
نویسندگان
چکیده
We propose general static block and block-cyclic heterogeneous decomposition of multidimensional data over processes of parallel program mapped onto multidimensional process grid. The decomposition is compared with decomposition of two-dimensional data over twodimensional process grid of Beaumont et al and with natural decomposition of three-dimensional data over three-dimensional process grid.
منابع مشابه
Natural Block Data Decomposition for Heterogeneous Clusters
We propose general purposes natural heuristics for static block and block-cyclic heterogeneous data decomposition over processes of parallel program mapped into multidimensional grid. This heuristics is an extension of the intuitively clear heterogeneous data distribution for one-dimensional case. It is compared to advanced heuristics for heterogeneous data decomposition proposed for solving li...
متن کاملStatic LU Decomposition on Heterogeneous Platforms
In this paper, the authors deal with algorithmic issues on heterogeneous platforms. They concentrate on dense linear algebra kernels, such as matrix multiplication or LU decomposition. Block-cyclic distribution techniques used in ScaLAPACK are no longer sufficient to balance the load among processors running at different speeds. The main result of this paper is to provide a static data distribu...
متن کاملGraph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members
Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...
متن کاملA group block distribution strategy for a heterogeneous machine
This paper discusses the data distribution problem for inherently sequential algorithms, such as the LU factorization in linear algebra, when computed on heterogeneous machines. These algorithms present additional difficulties to optimize the processing time due to the fact that the computational load for data matrix columns increases with their index, requiring a fine tuned load assignment and...
متن کاملBlock Data Decomposition for Partial - Homogeneous
This paper describes a block data partitioning algorithm suited to parallel processing in a heterogeneous network environment where some of the processors have the same performance capacity. Grid problems are particularly suited to block data partitioning schemes where communication cost is reduced by locating a grid point and its neighbors on the same physical processor whenever possible. Our ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003